%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYN049^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n027.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep  1 02:10:18 EDT 2023

% Result   : Theorem 3.41s 3.59s
% Output   : Proof 3.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN049^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat Aug 26 18:03:35 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 3.41/3.59  SZS status Theorem for theBenchmark.p
% 3.41/3.59  SZS output start Proof for theBenchmark.p
% 3.41/3.59  Clause #0 (by assumption #[]): Eq (Not (Exists fun Xx => ∀ (Xy Xz : Iota), (cP Xy → cQ Xz) → cP Xx → cQ Xx)) True
% 3.41/3.59  Clause #1 (by clausification #[0]): Eq (Exists fun Xx => ∀ (Xy Xz : Iota), (cP Xy → cQ Xz) → cP Xx → cQ Xx) False
% 3.41/3.59  Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (∀ (Xy Xz : Iota), (cP Xy → cQ Xz) → cP a → cQ a) False
% 3.41/3.59  Clause #3 (by clausification #[2]): ∀ (a a_1 : Iota), Eq (Not (∀ (Xz : Iota), (cP (skS.0 0 a a_1) → cQ Xz) → cP a → cQ a)) True
% 3.41/3.59  Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota), Eq (∀ (Xz : Iota), (cP (skS.0 0 a a_1) → cQ Xz) → cP a → cQ a) False
% 3.41/3.59  Clause #5 (by clausification #[4]): ∀ (a a_1 a_2 : Iota), Eq (Not ((cP (skS.0 0 a a_1) → cQ (skS.0 1 a a_1 a_2)) → cP a → cQ a)) True
% 3.41/3.59  Clause #6 (by clausification #[5]): ∀ (a a_1 a_2 : Iota), Eq ((cP (skS.0 0 a a_1) → cQ (skS.0 1 a a_1 a_2)) → cP a → cQ a) False
% 3.41/3.59  Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 : Iota), Eq (cP (skS.0 0 a a_1) → cQ (skS.0 1 a a_1 a_2)) True
% 3.41/3.59  Clause #8 (by clausification #[6]): ∀ (a : Iota), Eq (cP a → cQ a) False
% 3.41/3.59  Clause #9 (by clausification #[7]): ∀ (a a_1 a_2 : Iota), Or (Eq (cP (skS.0 0 a a_1)) False) (Eq (cQ (skS.0 1 a a_1 a_2)) True)
% 3.41/3.59  Clause #10 (by clausification #[8]): ∀ (a : Iota), Eq (cP a) True
% 3.41/3.59  Clause #11 (by clausification #[8]): ∀ (a : Iota), Eq (cQ a) False
% 3.41/3.59  Clause #12 (by backward demodulation #[10, 9]): ∀ (a a_1 a_2 : Iota), Or (Eq True False) (Eq (cQ (skS.0 1 a a_1 a_2)) True)
% 3.41/3.59  Clause #13 (by clausification #[12]): ∀ (a a_1 a_2 : Iota), Eq (cQ (skS.0 1 a a_1 a_2)) True
% 3.41/3.59  Clause #14 (by superposition #[13, 11]): Eq True False
% 3.41/3.59  Clause #15 (by clausification #[14]): False
% 3.41/3.59  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------